On cycle lengths in graphs of moderate degree
نویسندگان
چکیده
منابع مشابه
Cycle lengths in graphs with large minimum degree
Our main result is the following theorem. Let k 2 be an integer, G be a graph of su¢ ciently large order n; and (G) n=k: Then: (i)G contains a cycle of length t for every even integer t 2 [4; (G) + 1] : (ii) If G is nonbipartite then G contains a cycle of length t for every odd integer t 2 [2k 1; (G) + 1] ; unless k 6 and G belongs to a known exceptional class.
متن کاملA Note on Cycle Lengths in Graphs
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even t in the interval [4, ec(G)−K] and every odd t in the interval [K, oc(G)−K], where ec(G) and oc(G) denote the length of the longest even cycle in G and the longest odd cycle in G respectively. We also give a rough estim...
متن کاملCycle lengths in sparse graphs
Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value of |C(G)| over all graphs G of average degree d and girth g. Erdős [7] conjectured that |C(G)| = Ω ( d ) for all such graphs, and we prove this conjecture. We also show that this is a lower bound for the number of odd cycle lengths in a graph of chromatic number d and ...
متن کاملGraphs without repeated cycle lengths
In 1975, P. Erdös proposed the problem of determining the maximum number f(n) of edges in a graph of n vertices in which any two cycles are of different lengths. In this paper, it is proved that f(n) ≥ n + 36t for t = 1260r + 169 (r ≥ 1) and n ≥ 540t2 + 175811 2 t + 7989 2 . Consequently, lim infn→∞ f(n)−n √ n ≥ √
متن کاملOn Arithmetic Progressions Of Cycle Lengths In Graphs
A recently posed question of Häggkvist and Scott’s asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by proving that for k ≥ 2, a bipartite graph of average degree at least 4k and girth g contains cycles of (g/2 − 1)k consecutive even lengths. We also obtain a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90143-0